Approximation via Correlation Decay When Strong Spatial Mixing Fails
نویسندگان
چکیده
منابع مشابه
Approximation via Correlation Decay When Strong Spatial Mixing Fails
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin models. Previous analyses of correlation-decay algorithms implicitly depended on the occurrence of strong spatial mixing. This, roughly, means that one uses worst...
متن کاملCounting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin models. Previous analyses of correlation-decay algorithms implicitly depended on the occurrence of strong spatial mixing. This, roughly, means that one uses worst...
متن کاملThe Correlation Decay (cd) Tree and Strong Spatial Mixing in Multi-spin Systems
This paper deals with the construction of a correlation decay tree (hypertree) for interacting systems modeled using graphs (hypergraphs) that can be used to compute the marginal probability of any vertex of interest. Local message passing equations have been used for some time to approximate the marginal probabilities in graphs but it is known that these equations are incorrect for graphs with...
متن کاملWhen cross-modal spatial attention fails.
There is now convincing evidence that an involuntary shift of spatial attention to a stimulus in one modality can affect the processing of stimuli in other modalities, but inconsistent findings across different paradigms have led to controversy. Such inconsistencies have important implications for theories of cross-modal attention. The authors investigated why orienting attention to a visual ev...
متن کاملStrong Spatial Mixing in Homomorphism Spaces
Given a countable graph G and a finite graph H, we consider Hom(G ,H) the set of graph homomorphisms from G to H and we study Gibbs measures supported on Hom(G ,H). We develop some sufficient and other necessary conditions on Hom(G ,H) for the existence of Gibbs specifications satisfying strong spatial mixing (with exponential decay rate). We relate this with previous work of Brightwell and Win...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2019
ISSN: 0097-5397,1095-7111
DOI: 10.1137/16m1083906